Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition (Preliminary Version)
نویسنده
چکیده
We present an optimal parallel algorithm to construct the well-separated pair decomposition of a point set P in < d. We show how this leads to a deterministic optimal O(logn) time parallel algorithm for nding the k-nearest-neighbors of each point in P, where k is a constant. We discuss several additional applications of the well-separated pair decomposition for which we can derive faster parallel algorithms.
منابع مشابه
Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition
W e present an optimal parallel algorithm t o construct the well-separated pair decomposition of a point set P in Zd. W e show how this leads to a deterministic opt imal O(1ogn) t ime parallel algorithm for finding the k nearest neighbors of each point in P, where k is a constant. W e discuss several additional applications of the well-separated pair decomposition for which we can derive fas t ...
متن کاملBibliography of Literature
[3] P. B. Callahan, " Optimal parallel all-nearest-neighbors using the well-separated pair decomposition, " in
متن کاملAn optimal parallel algorithm for the all-nearest-foreign-neighbors problem in arbitrary dimensions
Given a set S of n points in IR D , D 2. Each point p 2 S is assigned a color c(p) chosen from a xed color set. The All-Nearest-Foreign-Neighbors Problem (ANFNP) is to nd for each point p 2 S its nearest foreign neighbors, i.e. the set of all points in Snfpg that are closest to p among the points in S with a color diierent from c(p). We introduce the Well Separated Color Decomposition (WSCD) wh...
متن کاملINDEX TERMS: none.
Well-separated pair decomposition, introduced by Callahan and Kosaraju [3], has found numerous applications in solving proximity problems for points in the Euclidean space. A pair of point sets (A, B) is c-well-separated if the distance between A,B is at least c times the diameters of both A and B. A well-separated pair decomposition of a point set consists of a set of well-separated pairs that...
متن کاملI/O-Efficient Well-Separated Pair Decomposition and its Applications
We present an external memory algorithm to compute a well-separated pair decomposition (WSPD) of a given point set P in d in O sort N I/Os using O N B blocks of external memory, where N is the number of points in P, and sort N denotes the I/O complexity of sorting N items. (Throughout this paper we assume that the dimension d is fixed). We also show how to dynamically maintain the WSPD in O log...
متن کامل